-
1 height-balanced tree
сбалансированное по высоте дерево
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > height-balanced tree
-
2 height-balanced tree
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > height-balanced tree
-
3 height-balanced tree
shea butter tree — масляное дерево, ши
-
4 height-balanced tree
Вычислительная техника: сбалансированное по высоте дерево -
5 height-balanced tree
English-Russian dictionary of computer science and programming > height-balanced tree
-
6 height-balanced tree
s.árbol de altura equilibrada, árbol de altura balanceada. -
7 height-balanced tree
English-Russian information technology > height-balanced tree
-
8 balanced tree
= B-tree IIдерево называется сбалансированным (или АВЛ-деревом - в честь его разработчиков G.M. Adelson-Velsky и Е.М. Landis), если для любой его вершины левое и правое поддеревья различаются по высоте не более чем на единицу. Хранение данных в виде сбалансированного дерева обеспечивает равнодоступность элементов данных.Syn:Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > balanced tree
-
9 height-balanced
English-Russian big polytechnic dictionary > height-balanced
-
10 height-balanced
English-Russian dictionary of Information technology > height-balanced
-
11 tree
1) древовидная схема, дерево; древовидный дешифратор2) т.граф. дерево•- and-or tree
- AVL-tree
- balanced tree
- binary tree
- Boolean tree
- clock tree
- cluster tree
- collapsed tree
- decision tree
- depth-balanced tree
- derivation tree
- directed tree
- directory tree
- edge-valued binary decision tree
- exclusive tree
- expanded tree
- fan-out tree
- fault tree
- folded tree
- game tree
- height-balanced tree
- hierarchical tree
- inclusive tree
- incremented tree
- inverted tree
- Lupanov's tree
- minimum length tree
- N-bit parity tree
- overlay tree
- parity tree
- pattern tree
- position tree
- production tree
- radix tree
- rooted tree
- scope tree
- searching tree
- search tree
- selection tree
- shalloow tree
- sink tree
- skewed tree
- spanning tree
- specification tree
- syntactic tree
- syntax tree
- undirected tree
- upside down tree
- VLSI search tree
- word-level decision tree
- XOR treeEnglish-Russian dictionary of computer science and programming > tree
-
12 branch
1) ветвь; ответвление || ветвиться; ответвляться2) ветка3) отвод4) отделение, филиал5) отрасль; подразделение6) нитка, ветвь ( трубопровода)7) тройник8) электр. плечо моста9) топогр. рукав (реки)10) метал. разветвленный питатель11) вчт. операция перехода, ветвление12) горн. промежуточный штрек, промежуточная выработка13) геогр. отрог (хребта)14) геогр. приток (реки)15) ручей; протока16) разветвлять(ся)•height of branch — матем. высота ветви
order of branch — матем. порядок ветви
to branch off — ответвляться; отходить от главного направления
См. также в других словарях:
Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
AVL tree — In computer science, an AVL tree is a self balancing binary search tree, and it is the first such data structure to be invented. [Robert Sedgewick, Algorithms , Addison Wesley, 1983, ISBN 0 201 06672 6, page 199, chapter 15: Balanced Trees.] In… … Wikipedia
Scapegoat tree — In computer science, a scapegoat tree is a self balancing binary search tree, invented by Igal Galperin and Ronald L. Rivest. It provides worst case O(log n ) lookup time, and O(log n ) amortized insertion and deletion time.Unlike other self… … Wikipedia
Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… … Wikipedia
Segment tree — In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be… … Wikipedia
Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… … Wikipedia
T-tree — In computer science a T tree is a type of binary tree data structure that is used by main memory databases, such as DataBlitz, e X treme DB, MySQL Cluster, Oracle TimesTen and [http://www.kairosdbms.com Kairos] [http://www.emware.co.kr… … Wikipedia
